//https://leetcode.cn/problems/find-minimum-in-rotated-sorted-array/

class Solution {
public:
    int findMin(vector<int>& nums) {
        int left = 0, right = nums.size() - 1, mid = 0;
        while (left < right)
        {
            int mid = left + (right - left) / 2;
            if (nums[mid] <= nums[right]) right = mid;
            else
                left = mid + 1;
        }

        return nums[left];

    }
};